An edge-based heuristic for Steiner routing

A new approximation heuristic for finding a rectilinear Steiner tree of a set of nodes is presented. It starts with a rectilinear minimum spanning tree of the nodes and repeatedly connects a node to the nearest point on the rectangular layout of an edge, removing the longest edge of the loop thus formed. A simple implementation of the heuristic using conventional data structures is compared with previously existing algorithms. The performance (i.e., quality of the route produced) of our algorithm is as good as the hest reported algorithm, while the running time is an order of magnitude better than that of this hest algorithm. It is also shown that the asymptotic time complexity for the algorithm can he improved to O(n log n), where n is the number of points in the set.